Discrete-time GeoX/G/1 que with non-preemptive priority
نویسندگان
چکیده
منابع مشابه
Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps
In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high ...
متن کاملDelay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline
Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-time queueing system with head-of-line (HOL) non-preemptive priority scheduling. Two classes of traffic will be considered, i.e., high-priority and lowpriority traffic, which both generate variable-length packets. We will...
متن کاملThe discrete-time preemptive repeat identical priority queue
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this contribution, we analyze a discretetime two-class preemptive repeat identical priority queue with infinite buffer space and generally distributed serv...
متن کاملAnalysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preemptive resume priority over customers of the other. Both classes contain customers with generally distributed service times. We show that the use of probability generating functions is beneficial for analyzing the system ...
متن کاملNotes on ‘ Performance Analysis Of The System Contents In A Discrete - time non - preemptive Priority Queue With General Service Times
2. The server is busy serving a class 2 packet during slot k. This can only be the case if at the beginning of the last “start slot” (this is start slot l, in which the service of the currently served packet started) there were no class 1 packets in the system. Otherwise, a class 1 packet would have gone into service at that time instead of a class 2 packet, because of the priority scheduling. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2003
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(03)90197-0